منابع مشابه
Noninteractive Zero-Knowledge
We investigate the possibility of disposing of interaction between Prover and Veriier in a zero-knowledge proof if they share beforehand a short random string. Without any assumption, we prove that non-interactive zero-knowledge proofs exist for some number theoretic languages for which no eecient algorithm is known. If deciding quadratic residuosity (modulo composite integers whose factorizati...
متن کاملInteractive and Noninteractive Zero Knowledge Coincide in the Help Model
We show that a problem in AM has a interactive zero-knowledge proof system if and only if it has a noninteractive zero knowledge proof system in the ‘help model’ of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference string is generated by a probabilistic polynomial-time dealer who is given access to the statement to be proven. Our result holds for both computational...
متن کاملNoninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors problem and the complement of the shortest vector problem. Prior proof systems for lattice problems were either interactive or leaked knowledge (or both). Our systems are the first known NISZK proofs for any cryptogra...
متن کاملInteractive and Noninteractive Zero Knowledge are Equivalent in the Help Model
We show that interactive and noninteractive zero-knowledge are equivalent in the ‘help model’ of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference string is generated by a probabilistic polynomial-time dealer who is given access to the statement to be proven. Our results do not rely on any unproven complexity assumptions and hold for statistical zero knowledge, for...
متن کاملOn the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs
We consider the basic cryptographic primitive known as ztro-kitowledge proofs on coinrnittcd bats. In this primitive, a prover f’ coriirriits to a set of bits, and then at a later time convinces a verifier V that some property P holds for a subset of these bits. It is known how to iiiipleriient this priniitive based on an ordinary bit-comniittal primitive, but the standard irnplerrientations in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1991
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0220068